Mean square value of exponential sums related to representation of integers as sum of two squares
نویسندگان
چکیده
1. Introduction. The problem we address here arises in the study of the error function in the shifted circle problem (see [BCDL]). Let α = (α 1 , α 2) ∈ R
منابع مشابه
1 F eb 2 00 5 ON SUMS OF THREE SQUARES
Let r 3 (n) be the number of representations of a positive integer n as a sum of three squares of integers. We give two distinct proofs of a conjecture of Wagon concerning the asymptotic value of the mean square of r 3 (n).
متن کاملDefining Sums of Products of Power Sums
We study the sums of products of power sums of positive integers and their generalizations, using the multiple products of their exponential generating functions. The generalizations include a closed form expression for the sums of products of infinite series of the form ∑∞ n=0 α n, 0 < |α| < 1, k ∈ N0 and the related Abel sum, which define, in a unified way, the sums of products of the power s...
متن کاملSums of Primes and Squares of Primes in Short Intervals
Let H2 denote the set of even integers n 6≡ 1 (mod 3). We prove that when H ≥ X, almost all integers n ∈ H2 ∩ (X,X + H] can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes.
متن کاملOn the Representation of Primes in Q( √ 2) as Sums of Squares
It is shown that the set of prime integers in Q( √ 2) is partitioned into two sets with respect to their representation as a sum of squares: 1) a set S0 of primes that cannot be represented as a sum of squares; 2) a set S2 of primes that can be represented as a sum of two squares. Moreover, we give an effective, polynomial-time Euclidean Algorithm for the ring of integers of the cyclotomic fiel...
متن کاملA ug 2 00 9 ENUMERATION OF 4 × 4 MAGIC SQUARES
A magic square is an n × n array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for n = 4, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the n = 3 case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane a...
متن کامل